Constructing large feasible suboptimal intervals for constrained nonlinear optimization
نویسندگان
چکیده
منابع مشابه
RAL - TR - 95 - 037 Constructing appropriate models for large - scale , linearly - constrained , nonconvex , nonlinear optimization algorithms
We consider the algebraic issues concerning the solution of general, large-scale, linearly constrained nonlinear optimization problems. Particular attention is given to suitable methods for solving the linear systems which occur at each iteration of such methods. The main issue addressed is how to ensure that a quadratic model of the objective function is positive definite in the null-space of ...
متن کاملA feasible directions method on combining feasibility with descent for nonlinear constrained optimization
Abstract. In this paper, a modified gradient projection method is proposed to solve the nonlinear constrained optimization problems, where the search direction is obtained by combing feasibility with descent. In addition, it is pointed out that, for linear constrained optimization problems, this method may be simplified and viewed as the modified version to Rosen’s method. The theoretical analy...
متن کاملA Feasible Sequential Linear Equation Method for Inequality Constrained Optimization
In this paper, by means of the concept of the working set, which is an estimate of the active set, we propose a feasible sequential linear equation algorithm for solving inequality constrained optimization problems. At each iteration of the proposed algorithm, we first solve one system of linear equations with a coefficient matrix of size m × m (where m is the number of constraints) to compute ...
متن کاملA Superlinearly feasible SQP algorithm for Constrained Optimization
This paper is concerned with a Superlinearly feasible SQP algorithm algorithm for general constrained optimization. As compared with the existing SQP methods, it is necessary to solve equality constrained quadratic programming sub-problems at each iteration, which shows that the computational effort of the proposed algorithm is reduced further. Furthermore, under some mild assumptions, the algo...
متن کاملFlexible Penalty Functions for Nonlinear Constrained Optimization
[Received on 31 March 2007] We propose a globalization strategy for nonlinear constrained optimization. The method employs a “flexible” penalty function to promote convergence, where during each iteration the penalty parameter can be chosen as any number within a prescribed interval, rather than a fixed value. This increased flexibility in the step acceptance procedure is designed to promote lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 1995
ISSN: 0254-5330,1572-9338
DOI: 10.1007/bf02096403